EmbedS: Scalable, Ontology-aware Graph Embeddings
نویسندگان
چکیده
While the growing corpus of knowledge is now being encoded in the form of knowledge graphs with rich semantics, the current graph embedding models do not incorporate ontology information into themodeling.We propose a scalable and ontology-aware graph embedding model, EmbedS, which is able to capture RDFS ontological assertions. EmbedS models entities, classes, and properties differently in an RDF graph, allowing for a geometrical interpretation of ontology assertions such as type inclusion, subclassing, and alike.
منابع مشابه
TorusE: Knowledge Graph Embedding on a Lie Group
Knowledge graphs are useful for many artificial intelligence (AI) tasks. However, knowledge graphs often have missing facts. To populate the graphs, knowledge graph embedding models have been developed. Knowledge graph embedding models map entities and relations in a knowledge graph to a vector space and predict unknown triples by scoring candidate triples. TransE is the first translation-based...
متن کاملOn Polyhedral Embeddings of Cubic Graphs
Polyhedral embeddings of cubic graphs by means of certain operations are studied. It is proved that some known families of snarks have no (orientable) polyhedral embeddings. This result supports a conjecture of Grünbaum that no snark admits an orientable polyhedral embedding. This conjecture is verified for all snarks having up to 30 vertices using computer. On the other hand, for every nonorie...
متن کاملOn the Connectivity of Graphs Embedded in Surfaces II
Let κmax(Σ) denote the maximum value for the connectivity of any graph which embeds in the topological surface Σ. The connectivity interval for Σ is the set of integers in the interval [1, κmax(Σ)]. Given an integer i in [1, κmax(Σ)] it is a trivial problem to demonstrate that there is a graph Gi with connectivity i which also embeds in Σ. We will say that one can saturate the connectivity inte...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملLower Bounds on Embeddings of Planar Graphs into the l1 Metric
This paper presents an overview of existing bounds on l1-embeddings of planar metrics. A new family of graphs containing the K2,3 minor is introduced. Computational results on this family of graphs establish a new lower bound on the constant in the following conjecture: There exists an absolute constant Cmax > 0 such that every finite planar metric embeds into the l1 metric with distortion < Cm...
متن کامل